Two Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method
نویسندگان
چکیده مقاله:
این مقاله چکیده ندارد
منابع مشابه
A modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملMinimization of Utilization Time for Two Stage Specially Structured Flow Shop Scheduling problem with Setup Time, Job Weightage and Jobs in a String of Disjoint Job Blocks
In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کاملSolving the Two-Stage Hybrid Flow Shop Problem by a Branch-and-bound Algorithm
A set J of n jobs has to be scheduled in a manufacturing system with two stages (machining centers) Z1 and Z2. Each stage Zi (i = 1, 2) has mi identical machines in parallel (with max(m1, m2) ≥ 2). Each job j (j = 1, ..., n) has to be processed first for aj units of time by one machine of Z1, and then for bj units of time by one machine of Z2. These operations must be processed without preempti...
متن کاملTwo meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time
In this research, flexible flow shop scheduling with unrelated parallel machines at each stage are considered. The number of stages and machines vary at each stage and each machine can process specific operations. In other words, machines have eligibility and parts have different release times. In addition, the blocking restriction is considered for the problem. Parts should pass each stage and...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 3 شماره None
صفحات 0- 0
تاریخ انتشار 2013-09
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023